A Higher-Order Duration Calculus and Its Completeness
نویسنده
چکیده
This paper studies how to describe the real-time behaviour of programs using Duration Calculus. Since program variables are interpreted as functions over time in real-time programming, and it is inevitable to introduce quantifications over program variables in order to describe local variable declaration and declare local channel and so on, therefore, to establish a higher-order duration calculus (HDC) is necessary. We firstly establish HDC, then show some real-time properties of programs in terms of HDC, and lastly, prove that HDC is complete on abstract domains under the assumption that all program variables vary finitely in the paper.
منابع مشابه
Completeness Results for Higher - Order Equational Logic submitted
We present several results concerning deductive completeness of the simply typed λcalculus with constants and equational axioms. First, we prove deductive completeness of the calculus with respect to standard semantics for axioms containing neither free nor bound occurrences of higher-order variables. Using this result, we analyze some fundamental deductive and semantic properties of axiomatic ...
متن کاملExpressive Completeness of Duration Calculus
This paper compares the expressive power of first-order monadic logic of order, a fundamental formalism in mathematical logic and the theory of computation, with that of the Propositional version of Duration Calculus (PDC), a formalism for the specification of realtime systems. Our results show that the propositional duration calculus is expressively complete for first-order monadic logic of or...
متن کاملHigher-Order Matching in the Linear λ-calculus with Pairing
We prove that higher-order matching in the linear λ-calculus with pairing is decidable. We also establish its NP-completeness under the assumption that the right-hand side of the equation to be solved is given in normal form.
متن کاملExpressive Completeness ofDuration and Mean Value Calculi
This paper compares the expressive power of rst-order monadic logic of order, a fundamental formalism in mathematical logic and the theory of computation, with that of two formalisms for the speciication of real-time systems, the propositional versions of duration and mean value calculi. Our results show that the propositional mean value calculus is expressively complete for monadic rst-order l...
متن کاملHigher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations
This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an extension and refinement of Prehofer’s higher-order narrowing calculus LN using the techniques developed in the refinement of a first-order lazy narrowing calculus LNC. HOLN is defined to deal with both unoriented and oriented equat...
متن کامل